Pure Saddle Points and Symmetric Relative Payoff Games

نویسندگان

  • Peter Duersch
  • Jörg Oechssler
  • Burkhard C. Schipper
چکیده

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence are provided. We apply our theory to a rich collection of examples by noting that the class of symmetric two-player zero-sum games coincides with the class of relative payoff games associated with symmetric two-player games. This allows us to derive results on the existence of a finite population evolutionary stable strategies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Document de travail du LEM 2008-18 EXISTENCE OF EQUILIBRIUM IN MINIMAX INEQUALITIES, SADDLE POINTS, FIXED POINTS, AND GAMES WITHOUT CONVEXITY SETS

This paper characterizes the existence of equilibria in minimax inequalities without assuming any form of quasi-concavity of functions and convexity or compactness of choice sets. A new condition, called “local dominatedness property”, is shown to be necessary and further, under some mild continuity condition, sufficient for the existence of equilibrium. We then apply the basic result obtained ...

متن کامل

Pure strategy equilibria in symmetric two-player zero-sum games

We show that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure equilibrium. Further sufficient conditions for existence are provided. We point out that the class of symmetric two-player zero-sum games coincides with ...

متن کامل

Markov Decision Processes and Stochastic Games with Total Effective Payoff a

We consider finite Markov decision processes (MDPs) with undiscounted total effective payoff. We show that there exist uniformly optimal pure stationary strategies that can be computed by solving a polynomial number of linear programs. We apply this result to two-player zero-sum stochastic games with perfect information and undiscounted total effective payoff, and derive the existence of a sadd...

متن کامل

An Ordinal Minimax Theorem

One of the earliest solution concepts considered in game theory are saddle points, combinations of actions such that no player can gain by deviating (see, e.g., von Neumann and Morgenstern, 1947). In two-player zero-sum games, every saddle point happens to coincide with the optimal outcome both players can guarantee in the worst case and thus enjoys a very strong normative foundation. Unfortuna...

متن کامل

Nonconvergence to saddle boundary points under perturbed reinforcement learning

For several classes of reinforcement learning schemes, convergence to action profiles that are not Nash equilibria may occur with positive probability under certain conditions on the payoff function. In this paper, we explore how an alternative reinforcement learning scheme, where the strategy of each agent is also perturbed by a strategy-dependent perturbation (or mutations) function, may excl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1003.4277  شماره 

صفحات  -

تاریخ انتشار 2010